Mechanising first-order temporal resolution
نویسندگان
چکیده
منابع مشابه
Mechanising first-order temporal resolution
First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments. Although a complete and correct resolution-style calculus has already been suggested for t...
متن کاملTowards First-Order Temporal Resolution
In this paper we show how to extend clausal temporal resolution to the ground eventuality fragment of monodic first-order temporal logic, which has recently been introduced by Hodkinson, Wolter and Zakharyaschev. While a finite Hilbert-like axiomatization of complete monodic first order temporal logic was developed by Wolter and Zakharyaschev, we propose a temporal resolutionbased proof system ...
متن کاملMechanising Temporal Reasoning: Summary
The project, funded by the Engineering and Physical Sciences Research Council (EPSRC), was undertaken to continue research and development involving the proof tool Isabelle. The emphasis was on temporal logics. Its results include a mechanisation of the UNITY formalism [6] and an automatic tableaux-based proof tactic, Blast tac. Both of these are distributed with Isabelle. The research assistan...
متن کاملExploring the Monodic Fragment of First-Order Temporal Logic using Clausal Temporal Resolution
Until recently, first-order temporal logic has been little understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not available. However, a breakthrough by Hodkinson et.al., identifying a finitely axiomatisable fragment, termed the monodic fragment, has led to improved understanding of first-order temporal logi...
متن کاملFirst-order resolution for CTL
In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical first-order resolution techniques. Since there already exist a lot of welldeveloped first-order logic theorem provers, reusing those techniques provides great benefit for solving other similar problems. We do not attempt to prove CTL theorems directly within the temporal logic sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2005
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.10.005